Comments on the security of fast encryption algorithm for multimedia (FEA-M)

We show that the Fast Encryption Algorithm for Multimedia (FEA-w proposed by Yi et a1 is insecure. In particular, we present a simple attack that reduces the key to solving a set of linear equations. The low complexity of the attack combined with its simplicity makes it feasible in many multimedia applications. 11. FEA-M DESCRIPTION FEA-M encrypts 64 x 64 Boolean plaintext matrices using encryption and decryption operations of the original FEA-M algorithm as follows: The sender and the recipient are assumed to share a comP1exiv Of Obtaining both the session and the master 64x 64 Boolean key matrix. The authors in [5] described the Index Terms Cryptanalysis, Encryption, PEA-M.